Some lacunary conditions for Fourier-Stieltjes transforms
نویسندگان
چکیده
منابع مشابه
Some notes on L-projections on Fourier-Stieltjes algebras
In this paper, we investigate the relation between L-projections and conditional expectations on subalgebras of the Fourier Stieltjes algebra B(G), and we will show that compactness of G plays an important role in this relation.
متن کاملRepresentation of Functions as Absolutely Convergent Fourier-stieltjes Transforms
0. Introduction. Let G be a locally compact Abelian group, and G* its group of (continuous) characters. We write (y, x) to indicate the function on G*XG which is the value of the character y EG* at the point *6G, or, dually, the value of the character xEG at the point y EG*. Borel sets in G are taken to be the smallest cr-algebra of sets containing all closed sets. We consider the set of all re...
متن کاملGeneralized Cauchy-stieltjes Transforms of Some Beta Distributions
We express generalized Cauchy-Stieltjes transforms (GCST) of some particular beta distributions depending on a positive parameter λ as λ-powered Cauchy-Stieltjes transforms (CST) of some probability measures. The CST of the latter measures are shown to be the geometric mean of the CST of the Wigner law together with another one. Moreover, these measures are shown to be absolutely continuous and...
متن کاملOn Generalized Cauchy-stieltjes Transforms of Some Beta Distributions
We express the generalized Cauchy-Stieltjes transforms (GCST) of some particular Beta distributions depending on a positive parameter λ as λ-powered Cauchy-Stieltjes transforms (CST) of some probability measures. The CST of the latter measures are shown to be the geometric mean of the CST of the Wigner law together with another one. Moreover, they are absolutely continuous and we derive their d...
متن کاملOn Some Block Algorithms for Fast Fourier Transforms
Since the publication of the Cooley-Tukey algorithm a variety of related algorithms for fast Fourier transforms have been suggested by Gentleman/Sande, Stockham, Pease, Johnson/Burrus and others. These algorithms diier mainly in the way they store and access their data. From a numerical point of view, they use splitting which is related to a factorization of the complex Fourier transform matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arkiv för Matematik
سال: 1975
ISSN: 0004-2080
DOI: 10.1007/bf02386197